Randomized rounding

Results: 58



#Item
21Concentration Inequalities for Nonlinear Matroid Intersection∗ Konstantin Makarychev Microsoft Research Warren Schudy IBM Research

Concentration Inequalities for Nonlinear Matroid Intersection∗ Konstantin Makarychev Microsoft Research Warren Schudy IBM Research

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:28
22Texas A&M University Department of Mathematics April 2, 2006 Dear Student, Do you think math is fun? Come join our Summer Educational Enrichment in Math (SEE Math) program this summer and

Texas A&M University Department of Mathematics April 2, 2006 Dear Student, Do you think math is fun? Come join our Summer Educational Enrichment in Math (SEE Math) program this summer and "SEE" how much fun mathematics c

Add to Reading List

Source URL: see-math.math.tamu.edu

Language: English - Date: 2006-04-06 15:24:22
23informs  MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X | EISSN |xx|0000|0xxx

informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X | EISSN |xx|0000|0xxx

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-09-10 09:13:15
24Worst-case Optimal Join Algorithms Hung Q. Ngo Ely Porat  Christopher Ré

Worst-case Optimal Join Algorithms Hung Q. Ngo Ely Porat Christopher Ré

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2012-03-21 08:53:44
25A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Yuval Filmus Department of Computer Science University of Toronto

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint Yuval Filmus Department of Computer Science University of Toronto

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2012-08-16 03:01:30
26A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch†  Yossi Azar‡

A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch† Yossi Azar‡

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:14:47
27The Online Set Cover Problem (Extended Abstract) Noga Alon∗  Baruch Awerbuch†

The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch†

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:17:36
28Deriving greedy algorithms and Lagrangian-relaxation algorithms Neal E. Young February 16, 2007

Deriving greedy algorithms and Lagrangian-relaxation algorithms Neal E. Young February 16, 2007

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2008-04-29 13:22:24
29Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure

Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure

Add to Reading List

Source URL: thibaut.horel.org

Language: English - Date: 2015-01-22 00:44:30
30In D. Al–Dabass (Ed.), Proceedings of the 17th European Simulation Multiconference (pp. 105–110). Nottingham, UK, 2003. CONFLICT RESOLUTION BY RANDOM ESTIMATED COSTS ROMAN V BELAVKIN School of Computing Science, Midd

In D. Al–Dabass (Ed.), Proceedings of the 17th European Simulation Multiconference (pp. 105–110). Nottingham, UK, 2003. CONFLICT RESOLUTION BY RANDOM ESTIMATED COSTS ROMAN V BELAVKIN School of Computing Science, Midd

Add to Reading List

Source URL: www.eis.mdx.ac.uk

Language: English - Date: 2006-01-31 05:13:14